Low-rank Audio Signal Classification Under Soft Margin and Trace Norm Constraints
نویسندگان
چکیده
We propose an algorithm to do speech/non-speech classification based on low-rank matrix representative audio data. Conventionally, the low-rank matrix data can be represented by a vector in high dimensional space. Some learning algorithms are then applied in such a vector space for matrix data classification. Particularly, maximum margin classifiers, such as support vector machine (SVM) etc. have received a lot of attentions due to their effectiveness. In this paper, we classify the data directly in the matrix space. Our methodology is built on recent studies about matrix classification with the trace norm constrained weight matrix and SVM’s large-margin linear discrimination principle. The resulting low-rank SVM is then designed to maximize the margin between classes whilst minimizing the complexity of the classifier in both original and low-rank space. We compared our proposed algorithm with SVM and other state-ofthe-art matrix classification methods. Experimental studies on real life audio signal classification show the effectiveness of our algorithm.
منابع مشابه
Online Learning for Classification of Low-rank Representation Features and Its Applications in Audio Segment Classification
In this paper, a novel framework based on trace norm minimization for audio segment is proposed. In this framework, both the feature extraction and classification are obtained by solving corresponding convex optimization problem with trace norm regularization. For feature extraction, robust principle component analysis (robust PCA) via minimization a combination of the nuclear norm and the l1-n...
متن کاملUnifying Low-Rank Models for Visual Learning
Many problems in signal processing, machine learning and computer vision can be solved by learning low rank models from data. In computer vision, problems such as rigid structure from motion have been formulated as an optimization over subspaces with fixed rank. These hard -rank constraints have traditionally been imposed by a factorization that parameterizes subspaces as a product of two matri...
متن کاملIterative Reweighted Algorithms for Matrix Rank Minimization Iterative Reweighted Algorithms for Matrix Rank Minimization
The problem of minimizing the rank of a matrix subject to affine constraints has many applications in machine learning, and is known to be NP-hard. One of the tractable relaxations proposed for this problem is nuclear norm (or trace norm) minimization of the matrix, which is guaranteed to find the minimum rank matrix under suitable assumptions. In this paper, we propose a family of Iterative Re...
متن کاملIterative reweighted algorithms for matrix rank minimization
The problem of minimizing the rank of a matrix subject to affine constraints has applications in several areas including machine learning, and is known to be NP-hard. A tractable relaxation for this problem is nuclear norm (or trace norm) minimization, which is guaranteed to find the minimum rank matrix under suitable assumptions. In this paper, we propose a family of Iterative Reweighted Least...
متن کاملConvex Tuning of the Soft Margin Parameter
In order to deal with known limitations of the hard margin support vector machine (SVM) for binary classification — such as overfitting and the fact that some data sets are not linearly separable —, a soft margin approach has been proposed in literature [2, 4, 5]. The soft margin SVM allows training data to be misclassified to a certain extent, by introducing slack variables and penalizing the ...
متن کامل